Temporal logics with incommensurable distances are undecidable
نویسنده
چکیده
Temporal logic based on the two modalities “Since” and “Until” (TL) is the most popular logic for the specification of reactive systems. It is often called the linear time temporal logic. However, metric properties of real time cannot be expressed in this logic. The simplest modalities with metric properties are “X will happen within units of time”. The extension of TL by all these modalities with rational is decidable. We show that the extension of the linear time temporal logic by two modalities “X will happen within one unit of time”, “X will happen within unit of time” is undecidable, whenever is irrational. © 2007 Elsevier Inc. All rights reserved.
منابع مشابه
Temporal Logics over Transitive States
We investigate the computational behaviour of ‘two-dimensional’ propositional temporal logics over (N, <) (with and without the next-time operator ) that are capable of reasoning about states with transitive relations. Such logics are known to be undecidable (even Π 1 complete) if the domains of states with those relations are assumed to be constant. Motivated by applications in the areas of te...
متن کاملModel-checking branching-time properties of probabilistic automata and probabilistic one-counter automata
This paper studies the problem of model-checking of probabilistic automaton and probabilistic one-counter automata against probabilistic branching-time temporal logics (PCTL and PCTL∗). We show that it is undecidable for these problems. We first show, by reducing to emptiness problem of probabilistic automata, that the modelchecking of probabilistic finite automata against branching-time tempor...
متن کاملDecidable and Undecidable Fragments of First-Order Branching Temporal Logics
In this paper we analyze the decision problem for fragments of first-order extensions of branching time temporal logics such as computational tree logics CTL and CTL or Prior’s Ockhamist logic of historical necessity. On the one hand, we show that the one-variable fragments of logics like first-order C T L —such as the product of propositional C T L with simple propositional modal logic S5, or ...
متن کاملA Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic
Propositional interval temporal logics are quite expressive temporal logics that allow one to naturally express statements that refer to time intervals. Unfortunately, most such logics turned out to be (highly) undecidable. To get decidability, severe syntactic and/or semantic restrictions have been imposed to interval-based temporal logics that make it possible to reduce them to point-based on...
متن کاملOne-variable first-order linear temporal logics with counting
First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various timelines. However, following the introduction of the monodic formulas (where temporal operators can be applied only to subformulas with at most one free variable), there has been a renewed interest in understanding extension...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 205 شماره
صفحات -
تاریخ انتشار 2007